Mixed type converse duality in multiobjective programming problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed-type duality for multiobjective fractional variational control problems

The concept of mixed-type duality has been extended to the class of multiobjective fractional variational control problems. A number of duality relations are proved to relate the efficient solutions of the primal and its mixed-type dual problems. The results are obtained for ρ-convex (generalized ρ-convex) functions. The results generalize a number of duality results previously obtained for fin...

متن کامل

Mixed symmetric duality in non-differentiable multiobjective mathematical programming

Two mixed symmetric dual models for a class of non-differentiable multiobjective nonlinear programming problems with multiple arguments are introduced in this paper. These two mixed symmetric dual models unify the four existing multiobjective symmetric dual models in the literature. Weak and strong duality theorems are established for these models under some mild assumptions of generalized conv...

متن کامل

Generalized Invexity and Duality in Multiobjective Programming Problems

In this paper we consider a multiobjective optimization problem, and we prove Mond-Weir duality results under second-and higher-order conditions of the objective and constraint functions.

متن کامل

Second order symmetric duality for nonlinear multiobjective mixed integer programming

9 Abstract 10 We formulate two pairs of second order symmetric duality for nonlinear multiobjective mixed integer programs for 11 arbitrary cones. By using the concept of efficiency and second order invexity, we establish the weak, strong, converse 12 and self-duality theorems for our dual models. Several known results are obtained as special cases. 17 Following the earlier works of Dorn [5], D...

متن کامل

Minimax mixed integer symmetric duality for multiobjective variational problems

A Mond–Weir type multiobjective variational mixed integer symmetric dual program over arbitrary cones is formulated. Applying the separability and generalized F-convexity on the functions involved, weak, strong and converse duality theorems are established. Self duality theorem is proved. A close relationship between these variational problems and static symmetric dual minimax mixed integer mul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2005

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2004.09.031